From OWL-S to Timed Automata Network: Operational Semantic

From MITL to Timed Automata

We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction is much simpler than previously known and can be easily implemented. Prediction is very difficult, especially about the future. Niels Bohr

From Scenarios to Timed Automata

We describe a new method of synthesizing a formal model for real-time systems from scenarios. Scenarios, formally defined as Timed Event Sequences, together with mode graphs are used to describe behaviors of real-time systems. Given a set of Timed Event Sequences and a mode graph, our synthesis method constructs a minimal, acyclic, deterministic timed automaton that models the specified aspects...

A Compositional Operational Semantics for OWL-S

Software composition via workflow specifications has received a great deal of attention recently. One reason is the high degree of fit with the encapsulation of software modules in service-oriented fashion. In the Industry, existing workflow languages have been merged to form WS-BPEL, the Business Process Execution Language for Web Services. In the Research community OWL-S, a ontology for web s...

An Operational Semanti s for Timed RAISE

From Timed Reo Networks to Networks of Timed Automata

The Reo coordination language is an extensible graphical notation for component or service coordination wherein independent autonomous software entities exchange data through a connector or a network imposing synchronization and data constraints on those entities. Each connector is formed from a set of binary connectors, called channels, with precise semantics and, thus, amenable to formal veri...